On Ramsey numbers for linear forests
نویسندگان
چکیده
منابع مشابه
Local Ramsey numbers for linear forests
Let L be a disjoint union of nontrivial paths. Such a graph we call a linear forest. We study the relation between the 2-local Ramsey number R2-loc(L) and the Ramsey number R(L), where L is a linear forest. L will be called an (n, j)-linear forest if L has n vertices and j maximal paths having an odd number of vertices. If L is an (n, j)-linear forest, then R2-loc(L) = (3n − j)/2 + dj/2e −
متن کاملOn graphs with linear Ramsey numbers
For a ®xed graph H, the Ramsey number r (H ) is de®ned to be the least integer N such that in any 2-coloring of the edges of the complete graph KN, some monochromatic copy of H is always formed. Let H(n, ) denote the class of graphs H having n vertices and maximum degree at most . It was shown by Chvata l, RoÈdl, SzemereÂdi, and Trotter that for each there exists c ( ) such that r (H )< c ( )n...
متن کاملOn Bipartite Graphs with Linear Ramsey Numbers
We provide an elementary proof of the fact that the ramsey number of every bipartite graph H with maximum degree at most ∆ is less than 8(8∆)|V (H)|. This improves an old upper bound on the ramsey number of the n-cube due to Beck, and brings us closer toward the bound conjectured by Burr and Erdős. Applying the probabilistic method we also show that for all ∆≥1 and n≥∆+1 there exists a bipartit...
متن کاملLinear Ramsey Numbers for Bounded-Degree Hypergrahps
We show that the Ramsey number is linear for every uniform hypergraph with bounded degree. This is a hypergraph extension of the famous theorem for ordinary graphs which Chvátal et al. showed in 1983. While Cooley et al. showed it for the 2-color case recently and independently from the author, our theorem contains the multicolor case and our proof is simple and provides a stronger embedding le...
متن کاملOn the Ramsey numbers for linear forest versus some graphs
For given graphs G and H; the Ramsey number R(G;H) is the leastnatural number n such that for every graph F of order n the followingcondition holds: either F contains G or the complement of F contains H.In this paper firstly, we determine Ramsey number for union of pathswith respect to sunflower graphs, For m ≥ 3, the sunflower graph SFmis a graph on 2m + 1 vertices obtained...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1974
ISSN: 0012-365X
DOI: 10.1016/0012-365x(74)90136-8